Convex integer maximization via Graver bases
نویسندگان
چکیده
منابع مشابه
Convex integer maximization via Graver bases
We present a new algebraic algorithmic scheme to solve convex integer maximization problems of the following form, where c is a convex function on R and w1x, . . . , wdx are linear forms on R, max {c(w1x, . . . , wdx) : Ax = b, x ∈ N} . This method works for arbitrary input data A, b, d, w1, . . . , wd, c. Moreover, for fixed d and several important classes of programs in variable dimension, we...
متن کاملInteger Convex Maximization
We show that an important broad class of integer programming problems in variable dimension with convex objective functions is solvable in polynomial time, and discuss various applications including to multiway transportation problems, packing problems and partitioning problems.
متن کاملGraver Bases and Universal Gröbner Bases for Linear Codes
Linear codes over any finite field can be associated to binomial ideals. Focussing on two specific instances, called the code ideal and the generalized code ideal, we present how these binomial ideals can be computed from toric ideals by substituting some variables. Drawing on this result we further show how their Graver bases as well as their universal Gröbner bases can be computed.
متن کاملGraver basis and proximity techniques for block-structured separable convex integer minimization problems
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N-fold integer programs and two-stage stochastic integer programs with N scenarios. In previous work [R. Hemmecke, M. Köppe, R. Weismantel, A polynomial-time algorithm for optimizing over N-fold 4block decomposable integer programs, Proc. IPCO 2010, Lecture Notes in Computer Science, vol. 6080, Springer, 2...
متن کاملStochastic Shortest Paths Via Quasi-convex Maximization
We consider the problem of finding shortest paths in a graph with independent randomly distributed edge lengths. Our goal is to maximize the probability that the path length does not exceed a given threshold value (deadline). We give a surprising exact n n) algorithm for the case of normally distributed edge lengths, which is based on quasi-convex maximization. We then prove average and smoothe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2009
ISSN: 0022-4049
DOI: 10.1016/j.jpaa.2008.11.033